$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
نویسندگان
چکیده
We prove that for an arbitrarily small constant ε > 0, assuming NP 6⊆DTIME(2log n), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2log 1−ε n. This improves upon the previous hardness factor of (log n)δ for some δ > 0 due to [AKKV05].
منابع مشابه
Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm
We show that the Closest Vector Problem with Preprocessing over `∞ norm (CVPP∞) is NP-hard to approximate to within a factor of (log n)1/2− , unless NP⊆ DTIME (2polylog(n)). The result is the same as that in [19] by Regev and Rosen, but our proof methods are different from theirs. Their reductions are based on norm embeddings. However, our reductions are based on the reduction of [2] and the pr...
متن کاملComputing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One algorithm runs in O(n) preprocessing time and space and O(log n) query time. The other algorithm runs in O(n ) preprocessing time and O(n log n) space and O(n ) query time. Thus we exhibit a trade-off between preprocessi...
متن کاملOn Bounded Distance Decoding and the Closest Vector Problem with Preprocessing
We present a new efficient algorithm for the search version of the approximate Closest Vector Problem with Preprocessing (CVPP). This is the problem of finding a lattice vector whose distance from the target point is within some factor γ of the closest lattice vector, where the algorithm is allowed to take polynomial-length advice about the lattice from an unbounded preprocessing algorithm. Our...
متن کاملOn Hardness of Jumbled Indexing
Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a substring of T matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered a lot of interest in the last four years; for a partial list see [2, 6, 13, 16, 17, 20, 22, 24, 26, 30, 35, 36]. There is a naive algorithm that prepro...
متن کاملSieving for Closest Lattice Vectors (with Preprocessing)
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-quantum cryptography. The two main hard problems underlying its security are the shortest vector problem (SVP) and the closest vector problem (CVP). Various algorithms have been studied for solving these problems, and for SVP, lattice sieving currently dominates in terms of the asymptotic time com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1109.2176 شماره
صفحات -
تاریخ انتشار 2011